Genetic Algorithm used in Search of good Tailbiting Codes

نویسندگان

  • Piotr Remlein
  • Dawid Szlapka
چکیده

In a wireless transmission it is necessary to use the channel encoder in order to avoid losses due to transmission errors. This paper presents a method to design the tailbiting codes (TB) for packet data transmission over the additive white gaussian noise (AWGN) channel. In this paper, genetic algorithms (GA) [1] are used in search of good tailbiting codes. The GA technique is applied in search of good binary tailbiting systematic, rate 1/2 and 2/3 convolutional codes concatenated with 4-PSK and 8-PSK modulation and in search of good non binary rate 1/2 convolutional codes over ring Z4 concatenated with 16-QAM modulation. The search is based on the maximum free Euclidean distance criterion. It is found that the new approach is very effective especially in case of encoders with large number of inputs or with large number of states. Finally, the search results are presented in the tables.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ML Decoding of Block Codes on their Tailbiting Trellises

A m a x i m u m likelihood decoding algo-r i t h m is presented for tailbiting trellises for block codes. The algorithm works in t w o phases. The first phase is a V i t e r b i decoding algorithm on the tailbiting trellis, while the second uses the A* algorithm adapted for application in this context. Results of simulations on tailbiting trellises for some block codes, indicate that t h i s de...

متن کامل

Flow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search

Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...

متن کامل

Hybrid Type-II ARQ Schemes based on Convolutional Codes in Wireless Channels

|In this work we studied the performance of the hybrid type-II Automatic Repeat reQuest (ARQ) system on Rayleigh fading channels. This system is based on High Rate Optimized Rate Compatible Punctured Convolutional (HRO-RCPC) codes combined with simple repetition codes. The performance is investigated for di erent packet sizes and constraint lengths of the convolutional encoder. Additionally the...

متن کامل

Two decoding algorithms for tailbiting codes

This paper presents two efficient Viterbi decoding-based suboptimal algorithms for tailbiting codes. The first algorithm, called the wrap-around Viterbi algorithm (WAVA), falls into the circular decoding category. It processes the tailbiting trellis iteratively, explores the initial state of the transmitted sequence through continuous Viterbi decoding, and improves the decoding decision with it...

متن کامل

Optimal and near-optimal encoders for short and moderate-length tailbiting trellises

The results of an extensive search for short and moderatelength polynomial convolutional encoders for time-invariant tail-biting representations of block codes at rates R = 1=4; 1=3; 1=2; and 2=3 are reported. The tail-biting representations found are typically as good as the best known block codes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJCNIS

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2009